an optimization problem in graph theory in which the nodes (cities) of a graph are connected by directed edges (routes), where the weight of an edge ... [3 related articles]
Found on
http://www.britannica.com/eb/a-z/t/74
Given a number n of cities, along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to the starting point. This is equivalent to finding the Hamilton circuit of minimum weight in a weighted complete graph. Mathematical problems related ...
Found on
http://www.daviddarling.info/encyclopedia/T/traveling_salesman_problem.html
No exact match found.
